#pragma GCC optimize ("O3")
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#define ll long long
#define endl '\n'
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
using namespace std;
const int OO = 0x3f3f3f3f, N = 5e5 + 5, mod = 1e9 + 7;
int n, k;
string s;
int dp[N][30];
int go(int idx, int lst) {
if (idx == n) {
return 0;
}
if (dp[idx][lst] != -1)
return dp[idx][lst];
int ans = 1e9;
for (int i = 0; i < k; i++) {
if (lst != i)
ans = min(ans, go(idx + 1, i) + (s[idx] != (char) (i + 'A')));
}
return dp[idx][lst] = ans;
}
void print(int idx, int lst) {
if (idx == n) {
return;
}
for (int i = 0; i < k; i++) {
if (i != lst && go(idx + 1, i) + ((s[idx] - 'A') != i) == dp[idx][lst]) {
cout << (char) (i + 'A');
print(idx + 1, i);
return;
}
}
}
int main() {
fast;
memset(dp, -1, sizeof dp);
cin >> n >> k;
cin >> s;
cout << go(0, 29) << endl;
print(0, 29);
}
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |